Completeness of Kozen's Axiomatization for the Modal mu-Calculus: A Simple Proof
نویسنده
چکیده
The modal μ-calculus, introduced by Dexter Kozen, is an extension of modal logic with fixpoint operators. Its axiomatization, Koz, was introduced at the same time and is an extension of the minimal modal logic K with the so-called Park fixpoint induction principle. It took more than a decade for the completeness of Koz to be proven, finally achieved by Igor Walukiewicz. However, his proof is fairly involved. In this article, we present an improved proof for the completeness of Koz which, although similar to the original, is simpler and easier to understand.
منابع مشابه
Completeness for Coalgebraic Fixpoint Logic
We introduce an axiomatization for the coalgebraic fixed point logic which was introduced by Venema as a generalization, based on Moss’ coalgebraic modality, of the well-known modal mucalculus. Our axiomatization can be seen as a generalization of Kozen’s proof system for the modal mu-calculus to the coalgebraic level of generality. It consists of a complete axiomatization for Moss’ modality, e...
متن کاملCompleteness of Kozen's Axiomatisation of the Propositional mu-Calculus
Propositional μ-calculus is an extension of the propositional modal logic with the least fixpoint operator. In the paper introducing the logic Kozen posed a question about completeness of the axiomatisation which is a small extension of the axiomatisation of the modal system K. It is shown that this axiomatisation is complete.
متن کاملProbabilistic Mu-Calculus: Decidability and Complete Axiomatization
We introduce a version of the probabilistic μ-calculus (PMC) built on top of a probabilistic modal logic that allows encoding n-ary inequational conditions on transition probabilities. PMC extends previously studied calculi and we prove that, despite its expressiveness, it enjoys a series of good metaproperties. Firstly, we prove the decidability of satisfiability checking by establishing the s...
متن کاملCompleteness for the modal μ-calculus: separating the combinatorics from the dynamics
The modal mu-calculus is a very expressive formalism extending basic modal logic with least and greatest fixpoint operators. In the seminal paper introducing the formalism in the shape known today, Dexter Kozen also proposed an elegant axiom system, and he proved a partial completeness result with respect to the Kripke-style semantics of the logic. The problem of proving Kozen’s axiom system co...
متن کاملAn Easy Completeness Proof for the Modal mu-Calculus on Finite Trees
The μ-calculus is an extension of modal logic with a fixpoint operator. In 1983, Dexter Kozen suggested an axiomatization (see, e.g., [4]). It took more than ten years to prove completeness. This proof is due to Igor Wałukiewicz [7] and is quite involved. We propose here a simpler proof in a particular case. More precisely, we prove the completeness of the Kozen axiomatization Kμ extended with ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1408.3560 شماره
صفحات -
تاریخ انتشار 2014